Four-Group Decodable Space–Time Block Codes
نویسندگان
چکیده
منابع مشابه
Four-Group Decodable Space-Time Block Codes
Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the lowest decoding complexity among the known rate-one STBC, arising due to the complete separability of the transmitted symbols into four groups for maximum likelihood detection. The first and the second codes are delay-optimal if the number of transmit antennas is a power of 2 and even, resp...
متن کاملOn Decoding and Performance Optimizing of Four-Group Decodable Space-Time Block Codes
A class of rate-one space-time block codes (STBC) allowing the decoding of transmitted symbols into four groups is recently proposed by Yuen, Guan and Tjhung. This code is called four-group decodable STBC (4Gp-STBC). In this paper, the equivalent channel of 4Gp-STBC is derived and a new method to decode 4Gp-STBC based on sphere decoders is proposed. Furthermore, the performance of 4Gp-STBC is a...
متن کاملNested block decodable runlength-limited codes
Consider a d k RLL constraint that is contained in a d k RLL con straint where k d and d and x a codeword length q k It is shown that whenever there exist block decodable encoders with codeword length q for those two constraints there exist such encoders where one is a subgraph of the other furthermore both encoders can be decoded by essentially the same de coder Speci cally a d k RLL constrain...
متن کاملLocally Decodable Codes
Locally decodable codes are a class of error-correcting codes. Errorcorrecting codes help ensure reliable transmission of information over noisy channels. Such codes allow one to add redundancy, or bit strings, to messages, encoding them into longer bit strings, called codewords, in a way that the message can still be recovered even if a certain fraction of the codeword bits are corrupted. In t...
متن کاملLocally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that each of the encoded bits can be recovered with high probability by a measurement on at most q qubits of the quantum code, even if a constant fraction of its qubits have been corrupted adversarially. We show that such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2008
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2007.906729